Weighted Block Golub-Kahan-Lanczos Algorithms for Linear Response Eigenvalue Problem
نویسندگان
چکیده
منابع مشابه
Reorthogonalization for the Golub-Kahan-Lanczos bidiagonal reduction
The Golub–Kahan–Lanczos (GKL) bidiagonal reduction generates, by recurrence, the matrix factorization of X ∈ Rm×n,m ≥ n, given by X = U BV T where U ∈ Rm×n is left orthogonal, V ∈ Rn×n is orthogonal, and B ∈ Rn×n is bidiagonal. When the GKL recurrence is implemented in finite precision arithmetic, the columns of U and V tend to lose orthogonality, making a reorthogonalization strategy necessary...
متن کاملReorthogonalization for Golub–kahan–lanczos Bidiagonal Reduction: Part Ii – Singular Vectors
where U ∈ R is left orthogonal, V ∈ R is orthogonal, and B ∈ R is bidiagonal. When the Lanczos recurrence is implemented in finite precision arithmetic, the columns of U and V tend to lose orthogonality, making a reorthogonalization strategy necessary to preserve convergence of the singular values. A new strategy is proposed for recovering the left singular vectors. When using that strategy, it...
متن کاملOn the Lanczos and Golub-Kahan reduction methods applied to discrete ill-posed problems
The symmetric Lanczos method is commonly applied to reduce large-scale symmetric linear discrete ill-posed problems to small ones with a symmetric tridiagonal matrix. We investigate how quickly the nonnegative subdiagonal entries of this matrix decay to zero. Their fast decay to zero suggests that there is little benefit in expressing the solution of the discrete ill-posed problems in terms of ...
متن کاملPerformance Evaluation of Golub-Kahan-Lanczos Algorithm with Reorthogonalization by Classical Gram-Schmidt Algorithm and OpenMP
The Golub-Kahan-Lanczos algorithm with reorthogonalization (GKLR algorithm) is an algorithm for computing a subset of singular triplets for large-scale sparse matrices. The reorthogonalization tends to become a bottleneck of elapsed time, as the iteration number of the GKLR algorithm increases. In this paper, OpenMP-based parallel implementation of the classical Gram-Schmidt algorithm with reor...
متن کاملGeneralized Golub-Kahan Bidiagonalization and Stopping Criteria
The Golub–Kahan bidiagonalization algorithm has been widely used in solving leastsquares problems and in the computation of the SVD of rectangular matrices. Here we propose an algorithm based on the Golub–Kahan process for the solution of augmented systems that minimizes the norm of the error and, in particular, we propose a novel estimator of the error similar to the one proposed by Hestenes a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2019
ISSN: 2227-7390
DOI: 10.3390/math7010053